FINITE VORONOI DECOMPOSITIONS OF INFINITE VERTEX TRANSITIVE GRAPHS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Transitive Permutation Groups and Finite Vertex-Transitive Graphs

The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...

متن کامل

Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs

This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.

متن کامل

Transitive decompositions of graphs

A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...

متن کامل

Uncountable families of vertex-transitive graphs of finite degree

Recently the following question was relayed [1] to the second author: What is the cardinality of the set of vertex transitive graphs of finite degree? Our aim in this short note is to show that there are 20 such graphs. Our proof is constructive and is based on ideas of B. Neumann [3]. In order to construct a large such set it is natural to turn to Cayley graphs of finitely generated groups (se...

متن کامل

Vertex-transitive CIS graphs

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Topology and Analysis

سال: 2013

ISSN: 1793-5253,1793-7167

DOI: 10.1142/s1793525313500088